GATE CSE 2016 SET-2


Q31.

Suppose that the eigen values of matrix A are 1, 2, 4. The determinant of (A^{-1})^{T} is _________.
GateOverflow

Q32.

The following function computes X^{Y} for positive integers X and Y. int exp(int X,int Y){ int res=1, a=X, b=Y; while (b!=0){ if(b%2==0){a=a*a; b=b/2;} else {res=res*a; b=b-1;} } return res; } Which one of the following conditions is TRUE before every iteration of the loop?
GateOverflow

Q33.

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?
GateOverflow

Q34.

The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)* (0+1)(0+1)* is _______.
GateOverflow

Q35.

Consider the following two statements: I. If all states of an NFA are accepting states then the language accepted by the NFA is \sum ^{*} . II. There exists a regular language A such that for all languages B, A\capB is regular. Which one of the following is CORRECT?
GateOverflow

Q36.

Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires
GateOverflow

Q37.

Let X be the number of distinct 16-bit integers in 2's complement representation. Let Y be the number of distinct 16 bit integers in sign magnitude representation. Then X-Y is ________.
GateOverflow

Q38.

Consider a processor with 64 registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and a twelve-bit immediate value. Each instruction must be stored in memory in byte-aligned fashion. If a program has 100 instructions, the amount of memory(in bytes) consumed by the program text is _____ .
GateOverflow

Q39.

A processor has 40 distinct instructions and 24 general purpose registers. A 32-bit instruction word has an opcode, two register operands and an immediate operand. The number of bits available for the immediate operand field is _______ .
GateOverflow

Q40.

A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10][3]; The grammars use D as the start symbol,and use six terminal symbols int ;id[]num. Which of the grammars correctly generate the declaration mentioned above?
GateOverflow